Choosing Subsets with Maximum Weighted Average
نویسندگان
چکیده
منابع مشابه
Choosing Subsets with Maximum Weighted Average
Given a set of n real values, each with a positive weight, we wish to find the subset of n− k values having maximum weighted average. This is equivalent to the following form of parametric selection: given n objects with values decreasing linearly with time, find the time at which the n− k maximum values add to zero. We show that these problems can be solved in time O(n) (independent of k). A g...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملComplexity of choosing subsets from color sets
We raise and investigate the algorithmic complexity of the following problem. Given a graph G = (V; E) and p-element sets L(v) for its vertices v 2 V such that jL(u) L(v)j p + r for all edges uv 2 E, do there exist q-element subsets C (v) L(v) with C (u) \ C (v) = ; for all uv 2 E ? Here p; q; r are positive integers, p q and p + r 2q. We characterize precisely which triples (p; q; r) admit a p...
متن کاملChoosing from a weighted tournament
A voting situation, in which voters are asked to rank all candidates pair by pair, induces a tournament and a weighted tournament, in which the strength of the majority matters. Each of these two tournaments induces in turn a two-player zero-sum game for which different solution concepts can be found in the literature. Four social choice correspondences for voting situations based exclusively o...
متن کاملk-forested choosability of graphs with bounded maximum average degree
a proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. a graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $g$ such that each vertex receives a color from its own list. in this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1997
ISSN: 0196-6774
DOI: 10.1006/jagm.1996.0849